منابع مشابه
Influence of polymer architectures on diffusion in unentangled polymer melts.
Recent simulations have indicated that the thermodynamic properties and the glassy dynamics of polymer melts are strongly influenced by the average molecular shape, as quantified by the radius of gyration tensor of the polymer molecules, and that the average molecular shape can be tuned by varying the molecular topology (e.g., ring, star, linear chain, etc.). In the present work, we investigate...
متن کاملDiffusion of a polymer in a random medium
2014 The effect of a random potential on the diffusion coefficient of a polymer is shown to be a relevant perturbation in the renormalization group sense below four dimensions. Attempts to « improve » the perturbation expansion by means of the renormalization group failed as it was not possible to locate a stable accessible fixed point. Speculations on the physical implications of these results...
متن کاملPolymer translocation through a nanopore: a showcase of anomalous diffusion.
The translocation dynamics of a polymer chain through a nanopore in the absence of an external driving force is analyzed by means of scaling arguments, fractional calculus, and computer simulations. The problem at hand is mapped on a one-dimensional anomalous diffusion process in terms of the reaction coordinate s (i.e., the translocated number of segments at time t ) and shown to be governed b...
متن کاملPancake Flipping Is Hard
Pancake Flipping is the problem of sorting a stack of pancakes of different sizes (that is, a permutation), when the only allowed operation is to insert a spatula anywhere in the stack and to flip the pancakes above it (that is, to perform a prefix reversal). In the burnt variant, one side of each pancake is marked as burnt, and it is required to finish with all pancakes having the burnt side d...
متن کاملGreedy Pancake Flipping
We prove that a stack of pancakes can be rearranged in all possible ways by a greedy process: Flip the maximum number of topmost pancakes that gives a new stack. We also show that the previous Gray code for rearranging pancakes (S. Zaks, A New Algorithm for Generation of Permutations BIT 24 (1984), 196-204) is a greedy process: Flip the minimum number of topmost pancakes that gives a new stack.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 2000
ISSN: 0028-0836,1476-4687
DOI: 10.1038/35018166